Efficient Multi-Agent Path Planning
نویسندگان
چکیده
Animating goal-driven agents in an environment with obstacles is a time consuming process, particularly when the number of agents is large. In this paper, we introduce an efficient algorithm that creates path plans for objects that move between user defined goal points and avoids collisions. In addition, the system allows “culling” of some of the computation for invisible agents: agents are accurately simulated only if they are visible to the user while the invisible objects are approximated probabilistically. The approximations ensure that the agent’s behaviors match those that would occur had they been fully simulated, and result in significant speedups over running the accurate simulation for all agents.
منابع مشابه
A Meta-Heuristic Approach For Energy-Efficient Multi-Agent Path Planning
We address the problem of multi-agent path planning (MAPP) by taking into account the total energy consumption of all agents, as measured by their cumulative distance travelled. A deterministic meta-heuristic technique called guided iterative prioritized planning (GIPP) is proposed to find good solutions with respect to this cumulative cost measure in a crowded environment. GIPP progressively e...
متن کاملEfficient Cooperative Path-Planning
Even after lots of effort made by today game companies, recent state of the art real-time strategy (RTS) games (e.g. Age of Empires, Warcraft III) lack an efficient robust path planner for mass multi-agent path planning. The main reason for this failure is that current methods do not try to solve the whole path planning problem as one task. One recent work that addresses this issue is Cooperati...
متن کاملMulti-agent Animation Techniques for Traffic Simulation in Urban Environment
This paper presents a traffic simulation system based on multi-agent animation method. The behaviour model of individual virtual agent defines the driving characteristics of the vehicle agent and cell-based configurations allow real-time dynamic path planning and efficient traffic flow simulations. By incorporating the advantages of discrete cellular automation algorithms and the continuous mod...
متن کاملMulti-agent Path Planning and Network Flow
This paper connects multi-agent path planning on graphs (roadmaps) to network flow problems, showing that the former can be reduced to the later, therefore enabling the application of combinatorial network flow algorithms, as well as general linear program techniques, to multi-agent path planning problems on graphs. Exploiting this connection, we show that when the goals are permutation invaria...
متن کاملMulti-agent Optimal Path Planning for Mobile Robots in Environment with Obstacles
The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation of environment models is described. When planning the path of each robot, the graph model of environment is dynamically changed for path correction and collision avoidance. New algorithm applies changes of robots’ paths and spe...
متن کامل